Online algorithms

Results: 217



#Item
31Analysis of algorithms / Computer science / Mathematics / Theoretical computer science / Applied mathematics / Online algorithms / Probabilistic complexity theory / Randomized algorithms / Adversary model / Algorithm / Pseudorandomness / Unique sink orientation

Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:28
32Online algorithms / Analysis of algorithms / Cache / Computer science / Applied mathematics / Mathematics / Cache algorithms / Algorithm / Competitive analysis / Computational complexity theory / Page replacement algorithm

CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:34:37
33Packing problems / Bin packing problem / Analysis of algorithms / Computer science / Mathematics / Online algorithms / Competitive analysis / Bin / Applied mathematics / Operations research / NP-complete problems

Dynamic Bin Packing of Unit Fractions Items Joseph Wun-Tat Chan† Tak-Wah Lam‡ ∗

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2008-04-19 01:25:32
34Virtual memory / Online algorithms / Software / Algorithm / Mathematical logic / Theoretical computer science / Mathematics / Paging / Applied mathematics / Page replacement algorithm

On Paging with Locality of Reference Susanne Albers Lene M. Favrholdty Oliver Gielz

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:07
35Scheduling / Computational complexity theory / Operations research / Mathematics / Applied mathematics / Analysis of algorithms / Online algorithms / Combinatorial optimization / Makespan / Job shop scheduling / Algorithm / Randomized algorithm

Chapter 1 Online Scheduling Susanne Albers University of Freiburg, Germany

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 10:58:01
36Analysis of algorithms / Online algorithms / Computer science / Probabilistic complexity theory / Randomized algorithm / Applied mathematics / Hoarding / Cache algorithms / Mathematics / Cache / Algorithm / Competitive analysis

On Generalized Connection Caching Susanne Albers Abstract Cohen et al. [5] recently initiated the theoretical study of connection caching in the world-wide web. They extensively studied uniform connection caching, where

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:47
37Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Spanning tree / Operations research / Combinatorial optimization / NP-hard problems / Online algorithm / Steiner tree problem / Minimum spanning tree / Travelling salesman problem

CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-01 15:15:38
38Online algorithms / Analysis of algorithms / Adversary model / List update problem / K-server problem / Algorithm / Randomized algorithm / Competitive analysis / Metrical task system

Mathemati al Programming manus ript No. (will be inserted by the editor) Susanne Albers Online Algorithms: A Survey

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:03:55
39NP-complete problems / Edsger W. Dijkstra / Spanning tree / Matroid theory / Operations research / Online algorithm / Steiner tree problem / Matroid / Shortest path problem / Algorithm / Travelling salesman problem / Greedy algorithm

CS264: Beyond Worst-Case Analysis Lecture #19: Online Algorithms and Random Permutations∗ Tim Roughgarden† December 1, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2015-01-04 19:18:44
40Cache / Online algorithms / Analysis of algorithms / Computer architecture / Algorithm / Competitive analysis / CPU cache

New Results on Web Caching with Request Reordering Susanne Albers Abstract We study web caching with request reordering. The goal is to maintain a cache of web documents so that a sequence of requests can be served at l

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:03:09
UPDATE